2,659 research outputs found
Modelling the Semantic Web using a Type System
We present an approach for modeling the Semantic Web as a type system. By
using a type system, we can use symbolic representation for representing linked
data. Objects with only data properties and references to external resources
are represented as terms in the type system. Triples are represented
symbolically using type constructors as the predicates. In our type system, we
allow users to add analytics that utilize machine learning or knowledge
discovery to perform inductive reasoning over data. These analytics can be used
by the inference engine when performing reasoning to answer a query.
Furthermore, our type system defines a means to resolve semantic heterogeneity
on-the-fly
Catalytic and communicating Petri nets are Turing complete
In most studies about the expressiveness of Petri nets, the focus has been put either on adding suitable arcs or on assuring that a complete snapshot of the system can be obtained. While the former still complies with the intuition on Petri nets, the second is somehow an orthogonal approach, as Petri nets are distributed in nature. Here, inspired by membrane computing, we study some classes of Petri nets where the distribution is partially kept and which are still Turing complete
Dependencies and Simultaneity in Membrane Systems
Membrane system computations proceed in a synchronous fashion: at each step
all the applicable rules are actually applied. Hence each step depends on the
previous one. This coarse view can be refined by looking at the dependencies
among rule occurrences, by recording, for an object, which was the a rule that
produced it and subsequently (in a later step), which was the a rule that
consumed it. In this paper we propose a way to look also at the other main
ingredient in membrane system computations, namely the simultaneity in the rule
applications. This is achieved using zero-safe nets that allows to synchronize
transitions, i.e., rule occurrences. Zero-safe nets can be unfolded into
occurrence nets in a classical way, and to this unfolding an event structure
can be associated. The capability of capturing simultaneity of zero-safe nets
is transferred on the level of event structure by adding a way to express which
events occur simultaneously
On Lyndon's equation in some Λ-free groups and HNN extensions
In this paper we study Lyndon's equation xpyqzr = 1, with x, y, z group elements and p, q, r positive integers, in HNN extensions of free and fully residually free groups, and draw some conclusions about its behavior in Λ-free group
A Grand Master of Discrete Mathematics
This issue is dedicated to Professor Sergiu Rudeanu on the occasion of his 80th birthday
Theoretical Aspects of Computing
We devote this issue of the Scientific Annals of Computer Science to the 11th International Colloquium on Theoretical Aspects of Computing. It contains the extended versions of five selected papers presented at ICTAC 2014 organized in Romania
Permutations of context-free, ET0L and indexed languages
© 2016 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France. For a language L, we consider its cyclic closure, and more generally the language Ck(L), which consists of all words obtained by partitioning words from L into k factors and permuting them. We prove that the classes of ET0L and EDT0L languages are closed under the operators Ck. This both sharpens and generalises Brandstädt's result that if L is context-free then Ck(L) is context-sensitive and not context-free in general for k ≥ 3. We also show that the cyclic closure of an indexed language is indexed
High-Level Koutny Net
This issue is dedicated to Professor Maciej Koutny for celebrating his 60th birthday, and consists of five contributions written by his friends and collaborators
- …